Tag count based priority scheduling algorithm for mitigating the RFID collisions
نویسندگان
چکیده
منابع مشابه
Optimal Detection Range of RFID Tag for RFID-based Positioning System Using the k-NN Algorithm
Positioning technology to track a moving object is an important and essential component of ubiquitous computing environments and applications. An RFID-based positioning system using the k-nearest neighbor (k-NN) algorithm can determine the position of a moving reader from observed reference data. In this study, the optimal detection range of an RFID-based positioning system was determined on th...
متن کاملAdaptive Framework for Collisions in RFID Tag Identification
Radio Frequency Identification (RFID) is promising, as a technique, to enable tracking of essential information about objects as they pass through supply chains. Information thus tracked can be utilised to efficiently operate the supply chain. Effective management of the supply chain translates to huge competitive advantage for the firms involved. Among several issues that impede seamless integ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMulti Priority Based Scheduling Algorithm for Queuing Systems
Mean waiting time is of a greater concern wherever queuing system is involved. Priority Scheduling is the general method used to reduce the mean waiting time of higher priority processes. However this method just focuses on favouring higher priority processes leaving the lower priority processes out of consideration and forcing them to starve for a longer period resulting in higher average mean...
متن کاملA Priority-Based Scheduling Algorithm for Real-Time Databases
Database systems for real-time applications must satisfy timing constraints associated with transactions, in addition to maintaining the consistency of data. In this paper we propose a priority-based scheduling algorithm for real-time database systems. We show that this algorithm is deadlock-free, and in addition, a high priority transaction is not blocked by uncommitted lower priority transact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2020
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v18.i1.pp434-442